Narayana prime cordial labeling of generalized Petersen Graph
نویسندگان
چکیده
منابع مشابه
PD-prime cordial labeling of graphs
vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...
متن کاملOn the Prime Labeling of Generalized Petersen Graphs
A graph G with vertex set V is said to have a prime labeling if its vertices can be labeled with distinct integers 1, 2, . . . , |V | such that for every edge xy in E, the labels assigned to x and y are relatively prime or coprime. A graph is called prime if it has a prime labeling. In this paper, we show that generalized Petersen graphs P (n, 3) are not prime for odd n, prime for even n ≤ 100 ...
متن کاملPrime Cordial Labeling of Some Graphs
In this paper we prove that the split graphs of 1,n K and are prime cordial graphs. We also show that the square graph of is a prime cordial graph while middle graph of is a prime cordial graph for . Further we prove that the wheel graph admits prime cordial labeling for . , n n B n , n n B n P 8 4 n
متن کامل3-Equitable Prime Cordial Labeling of Graphs
A 3-equitable prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that if an edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)−f(v)) = 1, the label 2 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)− f(v)) = 2 and 0 otherwise, then the number of edges labeled with i and the number of edges labeled with j differ b...
متن کامل$4$-Total prime cordial labeling of some cycle related graphs
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s20/0001